Clustering Motion
نویسندگان
چکیده
منابع مشابه
Clustering Motion
Given a set of moving points in IR, we show how to cluster them in advance, using a small number of clusters, so that at any time this static clustering is competitive with the optimal k-center clustering at that time. The advantage of this approach is that it avoids updating the clustering as time passes. We also show how to maintain this static clustering efficiently under insertions and dele...
متن کاملStochastic Motion Clustering
Abs t rac t . This paper presents a new method for motion segmentation, the clustering together of features that belong to independently moving objects. The method exploits the fact that two views of a rigidly connected 3D point set are linked by the 3 x 3 Fundamental Matrix which contains all the information on the motion of a given set of point correspondences. The segmentation problem is tra...
متن کاملGROUND MOTION CLUSTERING BY A HYBRID K-MEANS AND COLLIDING BODIES OPTIMIZATION
Stochastic nature of earthquake has raised a challenge for engineers to choose which record for their analyses. Clustering is offered as a solution for such a data mining problem to automatically distinguish between ground motion records based on similarities in the corresponding seismic attributes. The present work formulates an optimization problem to seek for the best clustering measures. In...
متن کاملMotion Clustering using Spatiotemporal Approximations
In this paper a new technique is proposed for the clustering and classification of spatio-temporal object trajectories extracted from video motion clips. The trajectories are represented as motion time series and modelled using Chebyshev polynomial approximations. Trajectory clustering is then performed to discover patterns of similar object motion. The coefficients of the basis functions are u...
متن کاملSpectral Clustering for Robust Motion Segmentation
In this paper, we propose a robust motion segmentation method based on the matrix factorization and subspace separation. We, first, mathematically prove that the shape interaction matrix can be derived using QR decomposition rather than Singular Value Decomposition(SVD). Using shape interaction matrix, we solve the motion segmentation problem using spectral graph clustering technique. We exploi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2004
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-004-2822-7